Partitioning Group by Cosets

Given a subgroup H of a group G, G can be expressed as a disjoint union of cosets of H in G, either all left or all right cosets. By this theorem, these cosets are all of the same size.

This is clear to see from proving two related results (either of which would be sufficient).


Theorem

Given two left cosets of H in G, gH and gH, exactly one of the following is true:

  1. gH=gH
  2. gHgH=

That is, any two cosets are either equal or disjoint.

We are going to prove this by showing that:

gHgHgH=gH

That is, the first case is true if and only if the negation of the second is false (i.e. the second is true).

For the first implication, we will assume that gHgH, that is, there exists an element which is common to both cosets, or an h,hH such that:

gh=gh.

It then follows from this that:

gh=ghg=g(hh1)ggH

and likewise that ggH.

Now we will show gH=gH by showing inclusions both ways.

Let agH be arbitrary, that is

a=gh1

for some h1H. However since ggH,

g=gh1

for some h1H.

Substituting the second of these expressions into the first we have that a=g(h1h1), and hence agH. Since a is chosen arbitrarily, gHgH. The reverse inclusion follows in the same way.

Corollary

abH for some cosets of H in G if and only if aH=bH.

This follows simply from the fact that aaH trivially, and hence aHbH at least contains a. This means they are not disjoint, and hence aH=bH.


Theorem

The operation

ggggH

is an equivalence relation on G.

Being an equivalence relation on G this partitions G into equivalence classes, which then correspond with the sets in the disjoint subset we use to express G.

Symmetry

Let gg for g,gG. Then, ggH, and hence there exists an hH such that g=gh.

Therefore gh1=g, and ggH since h1H.

Transitivity

Let gg and gg. Hence there exists h,hH such that:

g=ghandg=gh.

Now, g=ghh, and since H is closed under multiplication ggH, hence gg.

Reflexivity

Since H is a subgroup, idH, and hence for any gG, g=gidgH, thus gg.